# s3api_per_key_metadata

s3key: Microsoft_Research_Video_104293.asf
headers:
ETag: "31d0de779aab73a30fb87a45e04bfa60"
accept: */*
authorization: LOW Wrs3QiEcY53IjH1q:REDACTED_BY_IA_S3
connection: close
content-length: 110638042
expect: 100-continue
host: s3.us.archive.org
user-agent: curl/7.30.0
x-amz-auto-make-bucket: 1
x-archive-meta-creator: Microsoft Research
x-archive-meta-date: 2006-07-10
x-archive-meta-description: <p>Joint work with Ronan Collobert, Fabian Sinz, and Jason Weston.</p><p>Convex learning algorithms, such as Support Vector Machines (SVMs), are often seen as highly desirable because they offer strong practical properties and are amenable to theoretical analysis.  However, in this work we show how non-convexity can provide scalability advantages over convexity.  We show how concave-convex programming can be applied to produce (1)~faster SVMs where training errors are no longer support vectors, and (2)~much faster Transductive SVMs.</p><div class="fs30">©2006 Microsoft Corporation. All rights reserved.</div>
x-archive-meta-language: english
x-archive-meta-mediatype: movies
x-archive-meta-runtime: 00:48:02
x-archive-meta-subject: Microsoft Research; Microsoft Research Video Archive; Patrice Simard; Léon Bottou;
x-archive-meta-title: Microsoft Research Video 104293: Trading Convexity for Scalability
x-archive-meta-year: 2006
x-archive-meta01-collection: microsoft_research_video
x-upload-date: 2014-05-01T15:46:13.000Z


